Shellability of Posets of Labeled Partitions and Arrangements Defined by Root Systems
نویسنده
چکیده
We prove that the posets of connected components of intersections of toric and elliptic arrangements defined by root systems are EL-shellable and we compute their homotopy type. Our method rests on Bibby’s description of such posets by means of “labeled partitions”: after giving an EL-labeling and counting homology chains for general posets of labeled partitions, we obtain the stated results by considering the appropriate subposets.
منابع مشابه
Whitney Homology of Semipure Shellable Posets
We generalize results of Calderbank, Hanlon and Robinson on the representation of the symmetric group on the homology of posets of partitions with restricted block size. Calderbank, Hanlon and Robinson consider the cases of block sizes that are congruent to 0 mod d and 1 mod d for fixed d . We derive a general formula for the representation of the symmetric group on the homology of posets of pa...
متن کاملShellable Nonpure Complexes and Posets. I
The concept of shellability of complexes is generalized by deleting the requirement of purity (i.e., that all maximal faces have the same dimension). The usefulness of this level of generality was suggested by certain examples coming from the theory of subspace arrangements. We develop several of the basic properties of the concept of nonpure shellability. Doubly indexed f -vectors and h-vector...
متن کاملFree hyperplane arrangements associated to labeled rooted trees
To each labeled rooted tree is associated a hyperplane arrangement, which is free with exponents given by the depths of the vertices of this tree. The intersection lattices of these arrangements are described through posets of forests. These posets are used to define coalgebras, whose dual algebras are shown to have a simple presentation by generators and relations.
متن کاملPoset Topology: Tools and Applications
Contents Poset Topology: Tools and Applications 1 Introduction 3 Lecture 1. Basic definitions, results, and examples 5 1.1. Order complexes and face posets 5 1.2. The Möbius function 9 1.3. Hyperplane and subspace arrangements 11 1.4. Some connections with graphs, groups and lattices 16 1.5. Poset homology and cohomology 17 1.6. Top cohomology of the partition lattice 19 Lecture 2. Group action...
متن کاملOn Noncrossing and Nonnesting Partitions for Classical Reflection Groups
The number of noncrossing partitions of {1, 2, . . . , n} with fixed block sizes has a simple closed form, given by Kreweras, and coincides with the corresponding number for nonnesting partitions. We show that a similar statement is true for the analogues of such partitions for root systems B and C, defined recently by Reiner in the noncrossing case and Postnikov in the nonnesting case. Some of...
متن کامل